Optimization and dynamical systems algorithms for finding equilibria of stochastic games

نویسندگان

  • Arun Sen
  • David F. Shanno
چکیده

We present two new algorithms for computing Nash equilibria of stochastic games. One is a global random start algorithm based on nonlinear programming, while the other combines a dynamical system with nonlinear programming to find stable equilibria. Promising numerical results are presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Forward-Backward Stochastic Differential Equations and Controlled McKean Vlasov Dynamics

The purpose of this paper is to provide a detailed probabilistic analysis of the optimal control of nonlinear stochastic dynamical systems of the McKean Vlasov type. Motivated by the recent interest in mean field games, we highlight the connection and the differences between the two sets of problems. We prove a new version of the stochastic maximum principle and give sufficient conditions for e...

متن کامل

Computing Nash Equilibria for Stochastic Games

We present two new algorithms for computing Nash equilibria of stochastic games. One is a global random start algorithm based on nonlinear programming, while the other combines a dynamical system with nonlinear programming to find stable equilibria. Promising numerical results are presented.

متن کامل

Two-Timescale Algorithms for Learning Nash Equilibria in General-Sum Stochastic Games

We consider the problem of finding stationary Nash equilibria (NE) in a finite discounted general-sum stochastic game. We first generalize a non-linear optimization problem from [9] to a general N player game setting. Next, we break down the optimization problem into simpler sub-problems that ensure there is no Bellman error for a given state and an agent. We then provide a characterization of ...

متن کامل

Algorithms for Nash Equilibria in General-Sum Stochastic Games

Over the past few decades the quest for algorithms to compute Nash equilibria in general-sum stochastic games has intensified and several important algorithms (cf. [9], [12], [16], [7]) have been proposed. However, they suffer from either lack of generality or are intractable for even medium sized problems or both. In this paper, we first formulate a non-linear optimization problem for stochast...

متن کامل

Markov Decision Processes and Determining Nash Equilibria for Stochastic Positional Games

A class of stochastic positional games which extend the cyclic games and Markov decision problems with average and discounted optimization costs criteria is formulated and studied. Nash equilibria conditions for considered class of stochastic positional games are derived and some approaches for determining Nash equilibria are described.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Optimization Methods and Software

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2008